Parallel computation of pseudospectra of large sparse matrices
نویسندگان
چکیده
The parallel computation of the pseudospectrum is presented. The Parallel Path following Algorithm using Triangles (PPAT) is based on the Path following Algorithm using Triangles (PAT). This algorithm offers total reliability and can handle singular points along the level curve without difficulty. Furthermore, PPAT offers a guarantee of termination even in the presence of round-off errors and makes use of the large granularity for parallelism in PAT. This results in large speedups and high efficiency. The PPAT is able to trace multiple level curves simultaneously and takes into account the symmetry of the pseudospectrum in the case of real matrices to reduce the total computational cost. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Fvpspack: a Fortran and Pvm Package to Compute the Field of Values and Pseudospectra of Large Matrices Departments of Mathematics Fvpspack: a Fortran and Pvm Package to Compute the Field of Values and Pseudospectra of Large Matrices
The eld of values and pseudospectra are tools which yield insight into the spectral behavior of a matrix. For large sparse matrices, both sets can be eeciently computed using a Lanczos type method. Since both computations can be done in a natural parallel way, we have developed a package including Fortran and PVM routines. Experiments show that the PVM codes achieve excellent speed-ups and eeci...
متن کاملComputing the Field of Values and Pseudospectra Using the Lanczos Method with Continuation*
The field of values and pseudospectra are useful tools for understanding the behaviour of various matrix processes . To compute these subsets of the complex plane it is necessary to estimate one or two eigenvalues of a large number of parametrized Hermitian matrices; these computations are prohibitively expensive for large, possibly sparse, matrices, if done by use of the QR algorithm . We desc...
متن کاملComputation of Pseudospectra
There is more to the computation of pseudospectra than the obvious algorithm of computing singular value decompositions on a grid and sending the results to a contour plotter. Other methods may be hundreds of times faster. The state of the art is reviewed, with emphasis on methods for dense matrices, and a Matlab code is given.
متن کاملStructured Pseudospectra in Structural Engineering
This paper presents a new method for computing the pseudospectra of a matrix that respects a prescribed sparsity structure. The pseudospectrum is defined as the set of points in the complex plane to which an eigenvalue of the matrix can be shifted by a perturbation of a certain size. A canonical form for sparsity preserving perturbations is given and a computable formula for the corresponding s...
متن کاملParallel Computation of Spectral Portraits on the Meiko CS2
We describe a parallel software tool intended for the quantiication of the sensitivity of eigenvalues to matrix perturbations of varying size: the spectral portrait shows a representation of the normwise "-pseudospectra of a matrix A. This requires to compute k(A ? zI) ?1 k 2 for all z in a discretized region of the complex plane. The method used for computing k(A ? zI) ?1 k 2 has to be reliabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 28 شماره
صفحات -
تاریخ انتشار 2002